Smoothed analysis of termination of linear programming algorithmsSPIELMAN, Daniel A; TENG, Shang-Hua.Mathematical programming. 2003, Vol 97, Num 1-2, pp 375-404, issn 0025-5610, 30 p.Article

Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functionsZHAO, Y. B.Applied numerical mathematics. 2007, Vol 57, Num 9, pp 1033-1049, issn 0168-9274, 17 p.Article

An extended variant of Karmarkar's interior point algorithmNASERI, Rasool; VALINEJAD, Azizollah.Applied mathematics and computation. 2007, Vol 184, Num 2, pp 737-742, issn 0096-3003, 6 p.Article

A class of primal affine scaling algorithmsCUNHA, F. G. M; PINTO, A. W. M; OLIVEIRA, P. R et al.Applied mathematics and computation. 2011, Vol 218, Num 8, pp 4523-4532, issn 0096-3003, 10 p.Article

Multi-target linear-quadratic control problem and second-order cone programmingFAYBUSOVICH, L; MOUKTONGLANG, T.Systems & control letters. 2004, Vol 52, Num 1, pp 17-23, issn 0167-6911, 7 p.Article

A new primal-dual path-following interior-point algorithm for semidefinite optimizationWANG, G. Q; BAI, Y. Q.Journal of mathematical analysis and applications. 2009, Vol 353, Num 1, pp 339-349, issn 0022-247X, 11 p.Article

Convergence of a class of inexact interior-point algorithms for linear programsFREUND, R. W; JARRE, F; MIZUNO, S et al.Mathematics of operations research. 1999, Vol 24, Num 1, pp 50-71, issn 0364-765XArticle

Mathematical programming models and algorithms for engineering design optimizationHERSKOVITS, J; MAPPA, P; GOULART, E et al.Computer methods in applied mechanics and engineering. 2005, Vol 194, Num 30-33, pp 3244-3268, issn 0045-7825, 25 p.Article

Navy personnel planning and the optimal partitionHOLDER, Allen.Operations research. 2005, Vol 53, Num 1, pp 77-89, issn 0030-364X, 13 p.Article

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithmsMONTEIRO, Renato D. C; TSUCHIYA, Takashi.Mathematical programming. 2008, Vol 115, Num 1, pp 105-149, issn 0025-5610, 45 p.Article

Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problemsALVAREZ, Felipe; BOLTE, Jérôme; FREDERIC BONNANS, J et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 473-507, issn 0025-5610, 35 p.Article

A class of polynomial interior-point algorithms for the Cartesian P* (κ) second-order cone linear complementarity problemWANG, G. Q; ZHU, D. T.Nonlinear analysis. 2010, Vol 73, Num 12, pp 3705-3722, issn 0362-546X, 18 p.Article

Large-scale linear programming techniques for the design of protein folding potentialsWAGNER, Michael; MELLER, Jaroslaw; ELBER, Ron et al.Mathematical programming. 2004, Vol 101, Num 2, pp 301-318, issn 0025-5610, 18 p.Article

Examples of ill-behaved central paths in convex optimizationGILBERT, J. Charles; GONZAGA, Covis C; KARAS, Elizabeth et al.Mathematical programming. 2005, Vol 103, Num 1, pp 63-94, issn 0025-5610, 32 p.Article

Long-step homogeneous interior-point algorithm for the P_* -nonlinear complementarity problemsLESAJA, Goran.Yugoslav journal of operations research. 2002, Vol 12, Num 1, pp 17-48, issn 0354-0243, 32 p.Article

Search directions in the SDP and the monotone SDLCP : generalization and inexact computationKOJIMA, M; SHIDA, M; SHINDOH, S et al.Mathematical programming. 1999, Vol 85, Num 1, pp 51-80, issn 0025-5610Article

SURFACE RECONSTRUCTION AND IMAGE ENHANCEMENT VIA L¹-MINIMIZATIONDOBREV, Veselin; GUERMOND, Jean-Luc; POPOV, Bojan et al.SIAM journal on scientific computing (Print). 2011, Vol 32, Num 3, pp 1591-1616, issn 1064-8275, 26 p.Article

Simultaneous variable selectionTURLACH, Berwin A; VENABLES, William N; WRIGHT, Stephen J et al.Technometrics. 2005, Vol 47, Num 3, pp 349-363, issn 0040-1706, 15 p.Article

A full-Newton step interior-point algorithm based on modified Newton directionLIPU ZHANG; YINGHONG XU.Operations research letters. 2011, Vol 39, Num 5, pp 318-322, issn 0167-6377, 5 p.Article

Primal-dual interior-point algorithm for convex quadratic semi-definite optimizationWANG, G. Q; BAI, Y. Q.Nonlinear analysis. 2009, Vol 71, Num 7-8, pp 3389-3402, issn 0362-546X, 14 p.Article

A combined homotopy interior point method for the linear complementarity problemQIAN YU; CHONGCHAO HUANG; XIANJIA WANG et al.Applied mathematics and computation. 2006, Vol 179, Num 2, pp 696-701, issn 0096-3003, 6 p.Article

An interior point algorithm for convex quadratic programming with strict equilibrium constraintsBENOUAHBOUN, Rachid; MANSOURI, Abdelatif.RAIRO. Recherche opérationnelle. 2005, Vol 39, Num 1, pp 13-33, issn 0399-0559, 21 p.Article

Non-negatively constrained image deblurring with an inexact interior point methodBONETTINI, Silvia; SERAFINI, Thomas.Journal of computational and applied mathematics. 2009, Vol 231, Num 1, pp 236-248, issn 0377-0427, 13 p.Article

Solving continuous min-max problems by an iterative entropic regularization methodSHEU, R. L; LIN, J. Y.Journal of optimization theory and applications. 2004, Vol 121, Num 3, pp 597-612, issn 0022-3239, 16 p.Article

Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production : Adaptation of discrete metaheuristics to continuous optimizationTRONCOSO, Alicia; RIQUELME, José C; AGUILAR-RUIZ, Jesus S et al.European journal of operational research. 2008, Vol 185, Num 3, pp 1114-1127, issn 0377-2217, 14 p.Article